Partial Shape Matching Without Point-Wise Correspondence
نویسندگان
چکیده
منابع مشابه
Partial shape matching without point-wise corre- spondence
Partial similarity of shapes in a challenging problem arising in many important applications in computer vision, shape analysis, and graphics, e.g. when one has to deal with partial information and acquisition artifacts. The problem is especially hard when the underlying shapes are non-rigid and are given up to a deformation. Partial matching is usually approached by computing local descriptors...
متن کاملOpen-Curve Shape Correspondence Without Endpoint Correspondence
Shape correspondence is the foundation for accurate statistical shape analysis; this is usually accomplished by identifying a set of sparsely sampled and well-corresponded landmark points across a population of shape instances. However, most available shape correspondence methods can only effectively deal with complete-shape correspondence, where a one-to-one mapping is assumed between any two ...
متن کاملConstraining Contour Deformations Using Statistical A Priori Knowledge of Shape Without Requiring Point-to-Point Correspondence
In this paper we present a method for constraining the deformations of active contour models during image segmentation in a way that is consistent with a previously delineated training set of example images. The training examples are carefully traced with complete or semimanual supervision without the need for pointto-point correspondence. Then frequency domain shape descriptors (in particular,...
متن کاملEfficient Deformable Shape Correspondence via Kernel Matching
We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior on the mapping, and propose a projected descent optimization procedure inspired by difference of convex functions (DC) programming.
متن کاملPartial 3-D Correspondence from Shape Extremities
We present a 3-D correspondence method to match the geometric extremities of two shapes which are partially isometric. We consider the most general setting of the isometric partial shape correspondence problem, in which shapes to be matched may have multiple common parts at arbitrary scales as well as parts that are not similar. Our rank-and-vote-and-combine algorithm identifies and ranks poten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Mathematics: Theory, Methods and Applications
سال: 2013
ISSN: 1004-8979,2079-7338
DOI: 10.4208/nmtma.2013.mssvm12